Unfolding Rectangle-Faced Orthostacks
نویسندگان
چکیده
We prove that rectangle-faced orthostacks, a restricted class of orthostacks, can be grid-edge unfolded without additional refinement. We prove several lemmas applicable to larger classes of orthostacks, and construct an example to illustrate that our algorithm does not directly extend to more general classes of orthostacks.
منابع مشابه
Unfolding some classes of orthogonal polyhedra
In this paper, we study unfoldings of orthogonal polyhedra. More precisely, we deene two special classes of orthogonal polyhedra, orthostacks and orthotubes, and show how to generate unfoldings by cutting faces, such that the resulting surfaces can be attened into a single connected polygon.
متن کاملGrid Vertex-Unfolding Orthostacks
∗A preliminary version of this paper appeared in Revised Selected Papers from the Japan Conference on Discrete and Computational Geometry, Tokyo, Oct. 2004, LNCS 3742, 2005, pages 76–82. †Research supported in part by NSF grants CCF-0347776, OISE-0334653, and CCF-0430849, and by DOE grant DE-FG02-04ER25647. ‡Research supported in part by NSF grants OISE-0334653 and CCF-0430849. §Chercheur quali...
متن کاملUnfolding Orthogonal Terrains
It is shown that every orthogonal terrain, i.e., an orthogonal (rightangled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece by cutting along grid edges defined by coordinate planes through every vertex.
متن کاملUnfolding X-ray spectrum in the diagnostic range using the Monte Carlo Code MCNP5
Introduction: Unfolding X-ray spectrum is a powerful tool for quality control of X-ray tubes. Generally, the acquisition of the X-ray spectrum in diagnostic radiology departments is complicated and difficult due to high photon flux. Measurement of x ray spectra using radiation detectors could not be performed accurately, because of the pulse pile up. Therefore, indirect methods...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کامل